Safety Verification of a Train Interlocking Timed Automaton Model
نویسندگان
چکیده
منابع مشابه
Identifying an automaton model for timed data
A model for discrete event systems (DES) can be learned from observations. We propose a simple type of timed automaton to model DES where the timing of the events is important. Learning such an automaton is proven to be NP-complete by a reduction from the problem of learning deterministic finite state automata (DFA) without time. Based on this reduction, we show how the currently best learning ...
متن کاملPast pushdown timed automata and safety verification
We consider past pushdown timed automata that are discrete pushdown timed automata with past formulas as enabling conditions. Using past formulas allows a past pushdown timed automaton to access the past values of the finite state variables in the automaton. We prove that the reachability (i.e., the set of reachable configurations from an initial configuration) of a past pushdown timed automato...
متن کاملGenerating Test Cases for a Timed I/O Automaton Model
Recently various real-time communication protocols have been proposed. In this paper, first, we propose a timed I/O automaton model so that we can simply specify such real-time protocols. The proposed model can handle not only time but also data values. Then, we propose a conformance testing method for the model. In order to trace a test sequence (I/O sequence) on the timed I/O automaton model,...
متن کاملFormal Verification of Safety Critical Software with SPIN: Model Checking Applied to Railway Interlocking Systems
Linear temporal logic (LTL) has become a very basic tool for specifying properties of reactive and concurrent systems. For finite-state systems, it is possible to use techniques based on Büchi automata – along with LTL – to verify if a given system meets its specifications, that is, if specified properties hold or do not. There are two types of properties that can be expressed using LTL: safety...
متن کاملPushdown timed automata: a binary reachability characterization and safety verification
We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a state, dense clock values and a stack word. By using the pattern technique, we give a decidable characterization of the binary reachability (i.e., the set of all pairs of configurations such that one can reach the other) of a PTA. Since a ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.11.696